Incremental Computation Of Aggregate Operators Over Sliding Windows
نویسندگان
چکیده
Sliding Window is the most popular data model in processing data streams as it captures finite and relevant subset of an infinite stream. This paper studies different Mathematical operators used for querying and mining of data streams. The focus of our study is on operators, operating on the whole data set. These are termed as blocking operators. We have classified these operators according to their method of evaluation. An operator is termed as aggregate operator if it produces the sub-set of values satisfying some given condition. The evaluation of these operators is more complex when the query is continuous and data are changing. We present here a formal definition of incremental computation on sliding windows. We have proposed a vector model and graph abstraction to represent the sliding window and algorithms to evaluate Mathematical operators on the sliding window. The model is robust and can be applied to visualize different mathematical operators on the sliding window. We have introduced a novel concept of checkpoints in order to make the computation incremental. We present an efficient algorithm to find maximum (or minimum) on the sliding windows using the checkpoint concept.
منابع مشابه
On a Design Space for Aggregating over Sliding Windows on a Stream
On-line, continuous processing over streaming data challenges performance: processing time and memory space usage. This research is about the best performing way to compute an aggregate function over sliding windows containing the most recent data of a stream. The performance depends on the output semantics: input, aggregate function, accuracy requirements, retention as the quantity of elements...
متن کاملNear Real-Time Stereo With Adaptive Support Weight Approaches
Algorithms based on the adaptive support weight strategy currently represent the state-of-the-art in local stereo matching. Unfortunately, their good-quality results come at the price of high computation times: As opposed to standard local algorithms, incremental computation via sliding windows is not applicable for adaptive support weight windows. This paper presents a method for considerably ...
متن کاملProcessing Sliding Window Multi-Joins in Continuous Queries over Data Streams
We study sliding window multi-join processing in continuous queries over data streams. Several algorithms are reported for performing continuous, incremental joins, under the assumption that all the sliding windows fit in main memory. The algorithms include multiway incremental nested loop joins (NLJs) and multi-way incremental hash joins. We also propose join ordering heuristics to minimize th...
متن کاملGeneral Incremental Sliding-Window Aggregation
Stream processing is gaining importance as more data becomes available in the form of continuous streams and companies compete to promptly extract insights from them. In such applications, sliding-window aggregation is a central operator, and incremental aggregation helps avoid the performance penalty of re-aggregating from scratch for each window change. This paper presents Reactive Aggregator...
متن کاملCondensative Stream Query Language for Data Streams
In contrast to traditional database queries, a query on stream data is continuous in that it is periodically evaluated over fractions (sliding windows) of the data stream. This introduces challenges beyond those encountered when processing traditional queries. Over a traditional DBMS (Database Management System), the answer to an aggregate query is usually much smaller than the answer to a simi...
متن کامل